Decision trees for regular factorial languages

TOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES

We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...

Decision Problems for Non-regular Languages

We begin with studying closure properties of language classes. Informally, a closure property of a languages class C states that a certain type of transformation applied to languages in C always yields languages that belong to C as well. Examples for such transformations are: (i) Homomorphisms α : X∗ → Y ∗. They transform a language L ⊆ X∗ into the language α(L) = {α(w) | w ∈ L}. (ii) Inverse h...

Formalizing Symbolic Decision Procedures for Regular Languages

This thesis studies decision procedures for the equivalence of regular languages represented symbolically as regular expressions or logical formulas. Traditional decision procedures in this context rush to dispose of the concise symbolic representation by translating it into finite automata, which then are efficiently minimized and checked for structural equality. We develop procedures that avo...

Adapting phonetic decision trees between languages for continuous speech recognition

In a continuous speech recognition system it is important to model the context dependent variations in the pronunciations of phones. In this work we have attempted to build decision trees for modeling phonetic context-dependency in Hindi. The approach followed is to modify a decision tree built to model context-dependency in American English. The reason the decision trees turn out to be differe...

Learning MDL-guided Decision Trees for Constructor-Based Languages